Non-discrete linearly ordered groups
نویسندگان
چکیده
منابع مشابه
Clustering Non-Ordered Discrete Data
Clustering in continuous vector data spaces is a well-studied problem. In recent years there has been a significant amount of research work in clustering categorical data. However, most of these works deal with market-basket type transaction data and are not specifically optimized for high-dimensional vectors. Our focus in this paper is to efficiently cluster high-dimensional vectors in non-ord...
متن کاملLinearly Ordered Topological Spaces
This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...
متن کاملTransversals in non-discrete groups
The concept of ‘topological right transversal’ is introduced to study right transversals in topological groups. Given any right quasigroup S with a Tychonoff topology T , it is proved that there exists a Hausdorff topological group in which S can be embedded algebraically and topologically as a right transversal of a subgroup (not necessarily closed). It is also proved that if a topological rig...
متن کاملPath - integral over non - linearly realized groups and Hierarchy solutions
The technical problem of deriving the full Green functions of the elementary pion fields of the nonlinear sigma model in terms of ancestor amplitudes involving only the flat connection and the nonlinear sigma model constraint is a very complex task. In this paper we solve this problem by integrating, order by order in the perturbative loop expansion, the local functional equation derived from t...
متن کاملParsing Using Linearly Ordered Phonological Rules
A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing algorithm would face by encoding into the form being parsed the ambiguities which arise during parsing. The algorithm has been implemented and tested on real langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kodai Mathematical Journal
سال: 1950
ISSN: 0386-5991
DOI: 10.2996/kmj/1138833950